A Boolean Algebra Based Learnable Network

EmptyHeaded: Boolean Algebra Based Graph Processing

There are two types of high-performance graph processing engines: lowand high-level engines. Low-level engines (Galois, PowerGraph, Snap) provide optimized data structures and computation models but require users to write low-level imperative code; hence ensuring that efficiency is the burden of the user. In high-level engines users write in query languages like datalog (SociaLite) or SQL (Grai...

An Enhanced Approach To Network Reliability Using Boolean Algebra

1 Abstract The network reliability analysis problem consists of evaluating a measure of the reliability of a network. A more general context than the network reliability analysis is the stochastic coherent binary system (SCBS) analysis. One approach used in determining the reliability of a system involves Boolean algebra, and in particular a sum of disjoint products (SDP) technique. This paper ...

A Systematics of Deontic Action Logics Based on Boolean Algebra

Within the scope of interest of deontic logic, systems in which names of actions are arguments of deontic operators (deontic action logic) have attracted less interest than purely propositional systems. However, in our opinion, they are even more interesting from both theoretical and practical point of view. The fundament for contemporary research was established by K. Segerberg, who introduced...

Ternary Boolean Algebra

Boolean Algebra Approximations

Knight and Stob proved that every low4 Boolean algebra is 0-isomorphic to a computable one. Furthermore, for n = 1, 2, 3, 4, every lown Boolean algebra is 0-isomorphic to a computable one. We show that this is not true for n = 5: there is a low5 Boolean algebra that is not 0-isomorphic to any computable Boolean algebra. It is worth remarking that, because of the machinery developed, the proof u...